Optimal Packet Scheduling for Steerable Directional Antenna Systems

In this study, we focus on the packet scheduling problem especially with respect to the steering overhead of the steered antenna system. Our scheduling problem is investigated with a generic network model, while the objective of the problem is the throughput metric, which is the essentially metric in wireless systems. We prove the tractability of the problem by proposing an optimal covering algorithm (CA) in time O(|S|2) where |S| is the number of the neighbors (i.e., the connectivity). Based on the result of CA, we further proposed an optimal ordering algorithm (OA) in time O(|S| ln |S|) to minimize the maximum lateness of the traffic demand of its neighbor. I. I Antennas play a significant role in next generation wireless networks. The smart antenna technologies are arising in recent decade as a promising solution for future wireless systems. Especially, the steering of nulls reduces the interference of the jammer, and potentially further improves the spatial spectrum reusing. Furthermore, the adoption of the directional beam antennas advantages the signal sensitivity for the desired direction, which could benefit the system capacity. While the use of directional antennas brings the better performance and alleviates the signal fading as compared to the use of omni-directional antennas, one known disadvantage is the lack of mobility support since the narrow beamwidth of directional antennas limits the antenna’s coverage area. To overcome such drawback of the high gain directional antenna, the electronically steerable